Cleaning Massive Sonar Point Clouds Lars Arge∗ Kasper Green Larsen∗ Aarhus University

Source URL: www.cs.duke.edu

I/O-Efficient Algorithms for Computing Contours on a Terrain ∗ Pankaj K. Agarwal Lars Arge

Source URL: www.cs.duke.edu

Turning BIG terrain Data into Knowledge Lars Arge Co-founder, SCALGO Professor, Center director Center for Massive Data Algorithmics, Aarhus University

Source URL: www.brainsbusiness.dk

Computing Betweenness Centrality in External Memory Lars Arge MADALGO Dept. of Computer Science Aarhus University Email:

Source URL: www.vanwal.dk

From Point Cloud to Grid DEM: A Scalable Approach Pankaj K. Agarwal ?1 , Lars Arge ??12 , and Andrew Danner ???1 1 Department of Computer Science, Duke University, Durham, NC 27708, USA

Source URL: www.cs.swarthmore.edu

I/O-efficient Point Location using Persistent B-Trees Lars Arge∗ Andrew Danner† Sha-Mayn Teh

Source URL: www.cs.swarthmore.edu

• B-tree
• Data structures
• Computing
• R-tree
• Rope
• Persistent data structure
• Trie
• Segment tree
• B+ tree
• Binary trees
• Graph theory
• Data management

BIG DATA POSSIBILITIES AND CHALLENGES LARS ARGE PROFESSOR AND CENTER DIRECTOR AU

Source URL: conferences.au.dk

• Formal sciences
• Aarhus
• Big data
• Data analysis
• Technology
• Science
• Data management

External Memory Geometric Data Structures Lars Arge Department of Computer Science University of Aarhus and Duke University Augues 24, 2005

Source URL: www.daimi.au.dk

• Data management
• Computing
• Data structures
• Rope
• R-tree
• Tree
• Search tree
• Tango tree
• Binary search tree
• Binary trees
• Graph theory
• B-tree

Cache-Oblivious Data Structures for Orthogonal Range Searching Pankaj K. Agarwal∗ Lars Arge†

Source URL: www.daimi.au.dk

• Cache
• Computer science
• Cache-oblivious algorithm
• K-d tree
• Binary logarithm
• Computational geometry
• Range tree
• Fast Fourier transform
• Bin
• Mathematics
• Computing
• Analysis of algorithms